Two enumerative results on cycles of permutations
نویسنده
چکیده
Answering a question of Bóna, it is shown that for n ≥ 2 the probability that 1 and 2 are in the same cycle of a product of two n-cycles on the set {1, 2, . . . , n} is 1/2 if n is odd and 1 2 − 2 (n−1)(n+2) if n is even. Another result concerns the polynomial Pλ(q) = ∑ w q κ((1,2,...,n)·w), where w ranges over all permutations in the symmetric group Sn of cycle type λ, (1, 2, . . . , n) denotes the n-cycle 1 → 2 → · · · → n → 1, and κ(v) denotes the number of cycles of the permutation v. A formula is obtained for Pλ(q) from which it is deduced that all zeros of Pλ(q) have real part 0.
منابع مشابه
Blocks in cycles and k-commuting permutations
We introduce and study k-commuting permutations. One of our main results is a characterization of permutations that k-commute with a given permutation. Using this characterization, we obtain formulas for the number of permutations that k-commute with a permutation [Formula: see text], for some cycle types of [Formula: see text]. Our enumerative results are related with integer sequences in "The...
متن کاملThe cyclic structure of unimodal permutations
Unimodal (i.e. single-humped) permutations may be decomposed into a product of disjoint cycles. Some enumerative results concerning their cyclic structure — e.g. 23 of them contain fixed points — are given. We also obtain in effect a kind of combinatorial universality for continuous unimodal maps, by severely constraining the possible ways periodic orbits of any such map can nestle together. Bu...
متن کاملCycles and Patterns in Permutations
We study joint distributions of cycles and patterns in permutations written in standard cycle form. We explore both classical and generalised patterns of length 2 and 3. Many extensions of classical theory are achieved; bivariate generating functions for inversions, ascents, descents, 123s, valleys, 1’-2-1s; closed forms for avoidance of peaks, 2-3-1s, 1-2-3s, 2’-1-2s and 1’-2-1s; bijective pro...
متن کاملTwo vignettes on full rook placements
Using bijections between pattern-avoiding permutations and certain full rook placements on Ferrers boards, we give short proofs of two enumerative results. The first is a simplified enumeration of the 3124, 1234avoiding permutations, obtained recently by Callan via a complicated decomposition. The second is a streamlined bijection between 1342-avoiding permutations and permutations which can be...
متن کاملPermutations Richard
Permutations of finite sets play a central role in algebraic and enumerative combinatorics. In addition to having many interesting enumerative properties per se, permutations also arise in almost every area of mathematics and indeed in all the sciences. Here we will discuss three different topics involving permutations, focusing on combinatorics but also giving some hints about connections with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 32 شماره
صفحات -
تاریخ انتشار 2011